Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
511	Distributed Computing FS 2012 Prof. R. Wattenhofer Stephan Holzer Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Dominating set Chernoff bound Tango tree Theoretical computer science Mathematics Computational complexity theory
512	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
513	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
514	Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:04 Applied mathematics NP-complete problems Dominating set Random graph Connectivity Graph Theoretical computer science Mathematics Graph theory
515	PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior Sergiy Bogomolov Daniele Magazzeni Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2015-04-07 08:31:54 Hybrid automaton Continuous function Complete Heyting algebra Abstraction Automata theory Mathematics Mathematical analysis
516	ICS 161 — Algorithms — Spring 2005 — Second Midterm Please answer the following seven questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to wri Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-05-26 20:09:03 Operations research Graph theory Mathematical optimization NP-complete problems Network theory Algorithm Shortest path problem Dynamic programming Graph Theoretical computer science Mathematics Applied mathematics
517	On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗ Maike Buchin∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:52 NP-complete problems Hamiltonian path Icosahedron Combination puzzles Puzzles Line graph N-dimensional sequential move puzzle Graph theory Theoretical computer science Mathematics
518	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
519	Universidad de Buenos Aires Facultad de Ciencias Exactas y Naturales ´n Departamento de Computacio A study of the Combination Problem: Add to Reading List Source URL: dc.uba.ar Language: English - Date: 2014-11-21 09:25:33 Logic in computer science Electronic design automation Formal methods NP-complete problems Model theory Satisfiability Modulo Theories Satisfiability Boolean satisfiability problem Decision problem Theoretical computer science Mathematics Mathematical logic
520	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science

UPDATE